Semilinearity as a Syntactic Invariant
نویسندگان
چکیده
Mildly context sensitive grammar formalisms such as multi-component TAGs and linear context free rewrite systems have been introduced to capture the full complexity of natural languages. We show that, in a formal sense, Old Georgian can be taken to provide an example of a non-semilinear language. This implies that none of the aforementioned grammar formalisms is strong enough to generate this language.
منابع مشابه
Invariant Checking for Programs with Procedure Calls
Invariants are a crucial component of the overall correctness of programs. We explore the theoretical limits for doing automatic invariant checking and show that invariant checking is decidable for a large class of programs that includes some recursive programs. The proof uses known results like the decidability of Presburger arithmetic and the semilinearity of the Parikh image of a regular lan...
متن کاملBeyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars
Semilinearity is widely held to be a linguistic invariant but, controversially, some linguistic phenomena in languages like Old Georgian and Yoruba seem to violate this constraint. In this paper we extend distributional learning to the class of parallel multiple context-free grammars, a class which as far as is known includes all attested natural languages, even taking an extreme view on these ...
متن کاملImplicational (semilinear) logics II: additional connectives and characterizations of semilinearity
This is the continuation of the paper [4]. We continue the abstract study of non-classical logics based on the kind of generalized implication connectives they possess and we focus on semilinear logics, i.e. those that are complete with respect to the class of models where the implication defines a linear order. We obtain general characterizations of semilinearity in terms of the intersection-p...
متن کامل19 August 2013.dvi
The amalgamation property (AP) is of particular interest in the study of residuated lattices due to its relationship with various syntactic interpolation properties of substructural logics. There are no examples to date of non-commutative varieties of residuated lattices that satisfy the AP. The variety SemRL of semilinear residuated lattices is a natural candidate for enjoying this property, s...
متن کاملOn semilinearity in formal power series
A notion of semilinearity is introduced for formal power series as a natural generalization of semilinear languages over a commutative monoid. Some closure properties of the semilinear languages are established also for formal power series. In this way, a classical result due to Eilenberg and Sch utzenberger and some results due to Ginsburg are extended to series. We also prove that Parikh's t...
متن کامل